Dispersed Cryptography and the Quotient Ring Transform

نویسنده

  • Anna Johnston
چکیده

This paper describes a radically different privacy, security and integrity solution. Dispersed Cryptography converts the cloud from a security threat into a security asset by combining a standard stream cipher and the Quotient Ring Transform (QRT). The result is an integrated error correction/encryption algorithm. This encoding disperses data, breaking it into many smaller pieces and scattering them to different sites. No single site is critical; any can be lost without losing data. No single site can access data, even if the cryptovariable (secret key) is compromised. The resulting system is more flexible and seamlessly adds both data integrity and security. The underlying codes are linear, and therefore have homomorphic properties and may be used in coding based quantum resistant cryptography.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FUZZY SEMI-IDEAL AND GENERALIZED FUZZY QUOTIENT RING

The concepts of fuzzy semi-ideals of R with respect to H≤R and generalized fuzzy quotient rings are introduced. Some properties of fuzzy semiideals are discussed. Finally, several isomorphism theorems for generalized fuzzy quotient rings are established.

متن کامل

On zero-divisor graphs of quotient rings and complemented zero-divisor graphs

For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...

متن کامل

ElGamal Public-Key cryptosystem in multiplicative groups of quotient rings of polynomials over finite fields

The ElGamal encryption scheme is described in the setting of any finite cyclic group G. Among the groups of most interest in cryptography are the multiplicative group Z of the ring of integers modulo a prime p, and the multiplicative groups F of finite fields of characteristic two. The later requires finding irreducible polynomials h(x) and constructing the quotient ring . El-Kassar et al. modi...

متن کامل

Development of a Unique Biometric-based Cryptographic Key Generation with Repeatability using Brain Signals

Network security is very important when sending confidential data through the network. Cryptography is the science of hiding information, and a combination of cryptography solutions with cognitive science starts a new branch called cognitive cryptography that guarantee the confidentiality and integrity of the data. Brain signals as a biometric indicator can convert to a binary code which can be...

متن کامل

RESIDUAL OF IDEALS OF AN L-RING

The concept of right (left) quotient (or residual) of an ideal η by anideal ν of an L-subring μ of a ring R is introduced. The right (left) quotients areshown to be ideals of μ . It is proved that the right quotient [η :r ν ] of an idealη by an ideal ν of an L-subring μ is the largest ideal of μ such that[η :r ν ]ν ⊆ η . Most of the results pertaining to the notion of quotients(or residual) of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2017  شماره 

صفحات  -

تاریخ انتشار 2017